Equational presentations of functors and monads
نویسندگان
چکیده
In categorical universal algebra, it is well known that a finitary equational presentation of algebras in a finitary variety K amounts to the existence of a coequaliser of a pair of morphisms between finitely generated free algebras. The essence of a universal-algebraic flavour of a finitary functor L : K −→ K is that L is determined by its behaviour on finitely generated free algebras. In fact, such functors also admit an equational presentation, but this time the coequaliser is more complex, though it again involves functors freely generated from Set-functors. Recently, such functors L have appeared naturally in the study of modal algebras for coalgebraic modal logic, see, for example, Bonsangue and Kurz (2006) or Kurz and Rosický (2006). In fact, for the case of one-sorted varieties K , functors L that are determined by their values on finitely generated free algebras are exactly the functors preserving a class of colimits and referred to as sifted or, equivalently, they are exactly the class of functors admitting an equational presentation (Kurz and Rosický 2006). In the current paper we study presentations of functors/monads on K that are determined by finitely generated free algebras, but we want the requirements on K to be as relaxed as possible in view of Kurz et al. (2010). Hence we again study functors/monads L : K −→ K , but K is now only required to be a full subcategory of a variety, though K must still contain free objects on finitely many generators. Thus, the initial setting is now given by a finitary adjunction F U : K −→ X that is of descent type, that is, such that K embeds fully into the Eilenberg–Moore category
منابع مشابه
On Finitary Functors and Their Presentations
Finitary endofunctors of locally presentable categories are proved to have equational presentations. Special attention is paid to the Hausdorff functor of non-empty compact subsets of a complete metric space.
متن کاملPredicate Logic for Functors and Monads
This paper starts from the elementary observation that what is usually called a predicate lifting in coalgebraic modal logic is in fact an endomap of indexed categories. This leads to a systematic review of basic results in predicate logic for functors and monads, involving induction and coinduction principles for functors and compositional modal operators for monads.
متن کاملEquational Lifting Monads
We introduce the notion of an equational lifting monad: a commutative strong monad satisfying one additional equation (valid for monads arising from partial map classifiers). We prove that any equational lifting monad has a representation by a partial map classifier such that the Kleisli category of the former fully embeds in the partial category of the latter. Thus equational lifting monads pr...
متن کاملPolynomial and Analytic Functors and Monads, revisited
We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.
متن کاملAn equational notion of lifting monad
We introduce the notion of an equational lifting monad: a commutative strong monad satisfying one additional equation (valid for monads arising from partial map classifiers). We prove that any equational lifting monad has a representation by a partial map classifier such that the Kleisli category of the former fully embeds in the partial category of the latter. Thus equational lifting monads pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 21 شماره
صفحات -
تاریخ انتشار 2011